Localization in the Crowd with Topological Constraints
نویسندگان
چکیده
We address the problem of crowd localization, i.e., prediction dots corresponding to people in a crowded scene. Due various challenges, localization method is prone spatial semantic errors, predicting multiple within same person or collapsing cluttered region. propose topological approach targeting these errors. introduce constraint that teaches model reason about arrangement dots. To enforce this constraint, we define persistence loss based on theory persistent homology. The compares topographic landscape likelihood map and topology ground truth. Topological reasoning improves quality algorithm especially near regions. On public benchmarks, our outperforms previous methods. Additionally, demonstrate potential improving performance counting task.
منابع مشابه
Coordinated Crowd Simulation With Topological Scene Analysis
This paper proposes a new algorithm to produce globally coordinated crowds in an environment with multiple paths and obstacles. Simple greedy crowd control methods easily lead to congestion at bottlenecks within scenes, as the characters do not cooperate with one another. In computer animation, this problem degrades crowd quality especially when ordered behaviour is needed, such as soldiers mar...
متن کاملthe norms of localization in translating persian multimodal texts: the case of videogame demos
abstract هنجارهای بومی سازی در ترجمه متون چندوجهی فارسی:مورد دموهای بازیهای کامپیوتری چکیده اهداف عمده مطالعه حاضر به سه دسته تقسیم میشوند: 1) بررسی مشکلات احتمالی ترجمه دموهای (فیلمهای) بازیهای کامپیوتری،2) تعیین هنجارهای بومی سازی در ترجمه دموهای (فیلمهای) بازیهای کامپیوتری و 3) تعیین ایدئولوژیهایی که این هنجارها در جامعه نشان میدهند. به این منظور، ابتدا، مجموعه ای ازدموهای (فیلمهای) ب...
15 صفحه اولPlanar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cycle of the given graph and a set of its edges to be embedded inside this cycle and a set of its edges to be embedded outside this cycle. Their practical importance in graph visualization applications is due to the capa...
متن کاملGraph Embedding with Topological Cycle-Constraints
This paper concerns graph embedding under topological constraints. We address the problem of nding a planar embedding of a graph satisfying a set of constraints between its vertices and cycles that require embedding a given vertex inside its corresponding cycle. This problem turns out to be NP-complete. However, towards an analysis of its tractable subproblems, we develop an eecient algorithm f...
متن کاملAnderson localization of light with topological dislocations
Valery E. Lobanov,1 Yaroslav V. Kartashov,1,2 Victor A. Vysloukh,3 and Lluis Torner1 1ICFO-Institut de Ciencies Fotoniques, and Universitat Politecnica de Catalunya, 08860 Castelldefels (Barcelona), Spain 2Institute of Spectroscopy, Russian Academy of Sciences, Troitsk, Moscow Region, 142190, Russia 3Departamento de Fisica y Matematicas, Universidad de las Americas–Puebla, 72820 Puebla, Mexico ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i2.16170